Constraint Logic Programming Applied to Model Checking
نویسنده
چکیده
We review and discuss here some of the existing approaches based on CLP (Constraint Logic Programming) for verifying properties of various kinds of state-transition systems.
منابع مشابه
Constraint Logic Programming for Local and Symbolic Model-Checking
We propose a model checking scheme for a semantically complete fragment of CTL by combining techniques from constraint logic programming, a restricted form of constructive negation and tabled resolution. Our approach is symbolic in that it encodes and manipulates sets of states using constraints; it supports local model checking using goal-directed computation enhanced by tabulation. The framew...
متن کاملModel Checking Timed LTL: A Logic Programming-based Approach
In this paper, first, we introduce a temporal logic for specification of real-time systems. Our logic, called RTLTL, is an extension of linear temporal logic (LTL) with clocks and clock operations adopted from timed automata. RTLTL is a natural and simple language for specifying properties of real time systems. Second, we develop a model checker for RTLTL based on logic programming. We show how...
متن کاملSimulation Reduction as Constraint
The simulation relation is largely used in Model Checking where it allows to reduce Kripke structures, on which verification takes place, while preserving significant fragments of Temporal Logic. Our approach to the problem of simulation computation here has two aims: on the one hand we want to provide a framework in which developing algorithms competitive with the best ones in the literature, ...
متن کاملARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
Software model checking with abstraction refinement is emerging as a practical approach to verify industrial software systems. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. It is therefore natural to investigate whether and how the use of a constraint-based programming language may lead to an elegant and concise implementation of a prac...
متن کاملSymbolic Model Checking and Constraint Logic Programming: a Cross-Fertilization
A b s t r a c t . In this paper, we present the constraint language Toupie which is a finite domain /z-calculus interpreter that uses extended decision diagrams to represent relations and formulae. "Classical" constraint logic programming languages over finite domains (CLP(~':D)) are designed to find one solution to a constraint problem, eventually the best one according to a given criterion. I...
متن کامل